Characterizing almost-median graphs II
نویسندگان
چکیده
Let M, A, S, and P, be the sets of median graphs, almost-median graphs, semi-median graphs and partial cubes, respectively. Then M ⊂ A ⊂ S ⊂ P. It is proved that a partial cube is almost-median if and only if it contains no convex cycle of length greater that four. This extends the result of Brešar [2] who proved that the same property characterizes almost-median graphs within the class of semi-median graphs.
منابع مشابه
Almost Self-centered Median and Chordal Graphs
Almost self-centered graphs were recently introduced as the graphs with exactly two non-central vertices. In this paper we characterize almost selfcentered graphs among median graphs and among chordal graphs. In the first case P4 and the graphs obtained from hypercubes by attaching to them a single leaf are the only such graphs. Among chordal graph the variety of almost self-centered graph is m...
متن کاملFast recognition of classes of almost-median graphs
In this paper it is shown that a class of almost-median graphs that includes all planar almost-median graphs can be recognized in O(m log n) time, where n denotes the number of vertices and m the number of edges. Moreover, planar almost-median graphs can be recognized in linear time. As a key auxiliary result we prove that all bipartite outerplanar graphs are isometric subgraphs of the hypercub...
متن کاملPseudo-median graphs are join spaces
Bandelt, H.-J. and H.M. Mulder, Pseudo-median graphs are join spaces, Discrete Mathematics 109 (1992) 13-26. Median graphs are known to share a number of geometrica! properties with Euclidean space, as is testified by the fact that median graphs ale (c!osed) join spaces-the segments of the associated join space being the geodesic intervals of the graph. As is shown in this paper the median join...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملA simple axiomatization of the median procedure on median graphs
A profile π = (x1, ..., xk), of length k, in a finite connected graph G is a sequence of vertices of G, with repetitions allowed. A median x of π is a vertex for which the sum of the distances from x to the vertices in the profile is minimum. The median function finds the set of all medians of a profile. Medians are important in location theory and consensus theory. A median graph is a graph fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 312 شماره
صفحات -
تاریخ انتشار 2012